Torus-Based Cryptography
نویسنده
چکیده
In a series of three lectures, we will introduce the main concepts behind torus-based cryptography. Algebraic tori were suggested in 2003 by K. Rubin and A. Silverberg for use in public-key cryptography. Torus-based cryptosystems are based on the Discrete Logarithm Problem in a subgroup of Fqn called the primitive subgroup. It is conjectured that the elements of the primitive subgroup can be represented by only φ(n) elements of Fq (as opposed to n elements). Here φ is the Euler function, φ(n) = |Zn|.
منابع مشابه
Prime Order Primitive Subgroups in Torus-Based Cryptography
We use the Bateman-Horn conjecture to study the order of the set of Fq-rational points of primitive subgroups that arise in torus-based cryptography. We provide computational evidence to support the heuristics and make some suggestions regarding parameter selection for torus-based cryptography.
متن کاملTorus-Based Cryptography
We introduce the concept of torus-based cryptography, give a new public key system called CEILIDH, and compare it to other discrete log based systems including Lucas-based systems and XTR. Like those systems, we obtain small key sizes. While Lucas-based systems and XTR are essentially restricted to exponentiation, we are able to perform multiplication as well. We also disprove the open conjectu...
متن کاملCompression in Finite Fields and Torus-Based Cryptography
We present efficient compression algorithms for subgroups of multiplicative groups of finite fields, we use our compression algorithms to construct efficient public key cryptosystems called T2 and CEILIDH, we disprove some conjectures, and we use the theory of algebraic tori to give a better understanding of our cryptosystems, the Lucas-based, XTR and Gong-Harn cryptosystems, and conjectured ge...
متن کاملOn Cryptographic Schemes Based on Discrete Logarithms and Factoring
At CRYPTO 2003, Rubin and Silverberg introduced the concept of torus-based cryptography over a finite field. We extend their setting to the ring of integers modulo N . We so obtain compact representations for cryptographic systems that base their security on the discrete logarithm problem and the factoring problem. This results in smaller key sizes and substantial savings in memory and bandwidt...
متن کاملConstructive and destructive facets of torus-based cryptography
We introduce a constructive model for algebraic tori based on reduced divisors on singular curves. By using a singular hyperelliptic model, this provides an alternative representation, and computational model, for groups of rational points on an algebraic tori [4]. We obtain a represention of elements on certain tori of dimension r in compact representation using r +1 elements. By embedding the...
متن کامل